A new algorithm for line clipping against convex polyhedron is given. Thesuggested algorithm is faster for higher number of facets of the givenpolyhedron than the traditional Cyrus-Beck's and others algorithms withcomplexity O(N) . The suggested algorithm has O(N) complexity in the worst Ncase and expected O(sqrt(N))) complexity. The speed up is achieved because of'known order' of triangles. Some principal results of comparisons of selectedalgorithms are presented and give some imagination how the proposed algorithmcould be used effectively.
展开▼
